منابع مشابه
Almost - Interpolatory Chebyshev Quadrature
The requirement that a Chebyshev quadrature formula have distinct real nodes is not always compatible with the requirement that the degree of precision of an npoint formula be at least equal to n. This condition may be expressed as | \d\ \p = 0, 1 g p, where d (dx, ■ ■ ■ , d„) with Mo(w) ~ , -IT dj = 2w A iM ; = 1, 2, • • ■ , z!, ZJ ,_, Pj(io), j = 0, 1, • • • , are the moments of the weight fu...
متن کاملIntegral formulas for Chebyshev polynomials and the error term of interpolatory quadrature formulae for analytic functions
We evaluate explicitly the integrals ∫ 1 −1 πn(t)/(r ∓ t)dt, |r| = 1, with the πn being any one of the four Chebyshev polynomials of degree n. These integrals are subsequently used in order to obtain error bounds for interpolatory quadrature formulae with Chebyshev abscissae, when the function to be integrated is analytic in a domain containing [−1, 1] in its interior.
متن کاملOn computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملPositive interpolatory quadrature rules generated by some biorthogonal polynomials
Interpolatory quadrature rules whose abscissas are zeros of a biorthogonal polynomial have proved to be useful, especially in numerical integration of singular integrands. However, the positivity of their weights has remained an open question, in some cases, since 1980. We present a general criterion for this positivity. As a consequence, we establish positivity of the weights in a quadrature r...
متن کاملError bounds for interpolatory quadrature rules on the unit circle
For the construction of an interpolatory integration rule on the unit circle T with n nodes by means of the Laurent polynomials as basis functions for the approximation, we have at our disposal two nonnegative integers pn and qn, pn + qn = n − 1, which determine the subspace of basis functions. The quadrature rule will integrate correctly any function from this subspace. In this paper upper bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1973
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1973-0340908-0